From Linear Relaxations to Global Constraint Propagation
نویسندگان
چکیده
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assigned to an extreme point is therefore assigned to this extreme point in all solutions. We show how linear relaxations and the interior point method can be combined to prune variable domains. We also describe a class of constraints where our propagator enforces global arc consistency.
منابع مشابه
Reverse propagation of McCormick relaxations
Constraint propagation techniques have heavily utilized interval arithmetic while the application of convex and concave relaxations has been mostly restricted to the domain of global optimization. Here, reverse McCormick propagation, a method to construct and improve McCormick relaxations using a directed acyclic graph representation of the constraints, is proposed. In particular, this allows t...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملLinear and parabolic relaxations for quadratic constraints
This paper presents new techniques for filtering boxes in the presence of an additional quadratic constraint, a problem relevant for branch and bound methods for global optimization and constraint satisfaction. This is done by generating powerful linear and parabolic relaxations from a quadratic constraint and bound constraints, which are then subject to standard constraint propagation techniqu...
متن کاملDiscussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
Both theory and implementations in deterministic global optimization have advanced significantly in the past decade. Two schools have developed: the first employs various bounding techniques without validation, while the second employs different techniques, in a way that always rigorously takes account of roundoff error (i.e. with validation). However, convex relaxations, until very recently us...
متن کاملConstraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
W propose a cooperation method between constraint programming and integer programming to compute lower bounds for the resource-constrained project scheduling problem (RCPSP). The lower bounds are evaluated through linear-programming (LP) relaxations of two different integer linear formulations. Efficient resource-constraint propagation algorithms serve as a preprocessing technique for these rel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005